Stable and unstable attractors in Boolean networks
نویسندگان
چکیده
منابع مشابه
Stable and unstable attractors in Boolean networks.
Boolean networks at the critical point have been a matter of debate for many years as, e.g., the scaling of numbers of attractors with system size. Recently it was found that this number scales superpolynomially with system size, contrary to a common earlier expectation of sublinear scaling. We point out here that these results are obtained using deterministic parallel update, where a large fra...
متن کاملAttractors in continuous and Boolean networks.
We study the stable attractors of a class of continuous dynamical systems that may be idealized as networks of Boolean elements, with the goal of determining which Boolean attractors, if any, are good approximations of the attractors of generic continuous systems. We investigate the dynamics in simple rings and rings with one additional self-input. An analysis of switching characteristics and p...
متن کاملNumber of attractors in random Boolean networks.
The evaluation of the number of attractors in Kauffman networks by Samuelsson and Troein is generalized to critical networks with one input per node and to networks with two inputs per node and different probability distributions for update functions. A connection is made between the terms occurring in the calculation and between the more graphic concepts of frozen, nonfrozen, and relevant node...
متن کاملDistribution and enumeration of attractors in probabilistic Boolean networks.
Many mathematical models for gene regulatory networks have been proposed. In this study, the authors study attractors in probabilistic Boolean networks (PBNs). They study the expected number of singleton attractors in a PBN and show that it is (2 - (1/2)(L-1))(n), where n is the number of nodes in a PBN and L is the number of Boolean functions assigned to each node. In the case of L=2, this num...
متن کاملRhythmic and non-rhythmic attractors in asynchronous random Boolean networks.
In multi-component, discrete systems, such as Boolean networks and cellular automata, the scheme of updating of the individual elements plays a crucial role in determining their dynamic properties and their suitability as models of complex phenomena. Many interesting properties of these systems rely heavily on the use of synchronous updating of the individual elements. Considerations of parsimo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2005
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.72.055101